On Categorical Graph Grammars Integrating Structural Transformations and Operations on Labels

نویسنده

  • Hans Jürgen Schneider
چکیده

Graph-theoretic structures are an obvious means to reason about systems of asynchronous processes. Their dynamic behaviour can be simulated by applying productions of a graph grammar. The present paper is motivated by looking for a formal method that is able to describe the behaviour of systems of processes that share data structures. We generalize the categorical graph-grammar approach by labelling the graphs with elements of a suitable category rather than with those of an alphabet. Thus, operations can be performed on the labels while the graphs are rewritten. After presenting the fundamental definitions and some properties, we demonstrate the usefulness of the approach by modelling some well-known Petri nets as well as a generalized net the places of which are labelled with graphs. Finally, we show that known theoretical techniques are applicable to the generalized framework by exemplary discussing parallel independence of derivation steps.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Action Nets and Abstract Statecharts in the Theory of High-level Replacement Systems 5 Union and Transformation Concepts and Results

In software engineering one of the main issues is structuring. As well horizontal { composing and decomposing a system { as vertical structuring { stepwise reenement of a system { are essential for the development of large and complex systems. In this paper we transfer well-known structuring techniques for horizontal and vertical structuring, namely union and transformation to abstract statecha...

متن کامل

Interpreter Writing Using Graph Transformations

This paper introduces a UML-based approach for specifying model transformations. The technique is based on graph transformations, where UML class diagrams are used to represent the graph grammars of the input and the output of the transformations, and the transformations are represented as explicitly sequenced elementary rewriting operations. The paper discusses the visual language designed for...

متن کامل

Strengthening UML Collaboration Diagrams by State Transformations

Collaboration diagrams as described in the official UML documents specify patterns of system structure and interaction. In this paper, we propose their use for specifying, in addition, pre/postconditions and state transformations of operations and scenarios. This conceptual idea is formalized by means of graph transformation systems and graph process, thereby integrating the state transformatio...

متن کامل

Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations

A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...

متن کامل

Graph Transformations on Domain-Specific Models

In model driven development, model transformations play a crucial role. This paper introduces a new, UML-based approach for the specification and implementation of model transformations. The technique is based on graph transformations, where the transformations are a set of explicitly sequenced elementary rewriting operations. UML class diagrams are used to represent the graph grammars for the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 109  شماره 

صفحات  -

تاریخ انتشار 1993